Scalable Subspace Clustering with Application to Motion Segmentation
نویسندگان
چکیده
1.
منابع مشابه
Generalized Principal Component Analysis (GPCA): an Algebraic Geometric Approach to Subspace Clustering and Motion Segmentation by
Generalized Principal Component Analysis (GPCA): an Algebraic Geometric Approach to Subspace Clustering and Motion Segmentation
متن کاملA spectral clustering approach to motion segmentation based on motion trajectory
Multibody motion segmentation is important in many computer vision tasks. This paper presents a novel spectral clustering approach to motion segmentation based on motion trajectory. We introduce a new affinity matrix based on the motion trajectory and map the feature points into a low dimensional subspace. The feature points are clustered in this subspace using a graph spectral approach. By com...
متن کاملMotion Segmentation by Velocity Clustering with Estimation of Subspace Dimension
The performance of clustering based motion segmentation methods depends on the dimension of the subspace where the point trajectories are projected. This paper presents a strategy for estimating the best subspace dimension using a novel clustering error measure. For each obtained segmentation, the proposed measure estimates the average least square error between the point trajectories and synth...
متن کاملSpectral Clustering for Robust Motion Segmentation
In this paper, we propose a robust motion segmentation method based on the matrix factorization and subspace separation. We, first, mathematically prove that the shape interaction matrix can be derived using QR decomposition rather than Singular Value Decomposition(SVD). Using shape interaction matrix, we solve the motion segmentation problem using spectral graph clustering technique. We exploi...
متن کاملMotion Segmentation via Global and Local Sparse Subspace Optimization
In this paper, we propose a new framework for segmenting feature-based moving objects under affine subspace model. Since the feature trajectories in practice are highdimensional and contain a lot of noise, we firstly apply the sparse PCA to represent the original trajectories with a lowdimensional global subspace, which consists of the orthogonal sparse principal vectors. Subsequently, the loca...
متن کامل